A combinatorial proof and refinement of a partition identity of Siladić

نویسنده

  • Jehanne Dousse
چکیده

Rogers-Ramanujan type partition identities establish equalities between certain types of partitions with difference conditions and partitions whose generating functions is an infinite product. Since the 1980’s, many connections between representations of Lie algebras and RogersRamanujan type partition identities have emerged. Lepowsky and Wilson [6] were the first to establish this link by giving an interpretation of Theorem 1.1 in terms of representations of the affine Lie algebra sl(2,C)∼. Similar methods were subsequently applied to other representations of affine Lie algebras, yielding new partition identities of the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytic Proof of a Partition Identity 3 2 .

In this paper we give an analytic proof of the identity A 5,3,3 (n) = B 0 5,3,3 (n), where A 5,3,3 (n) counts the number of partitions of n subject to certain restrictions on their parts, and B 0 5,3,3 (n) counts the number of partitions of n subject to certain other restrictions on their parts, both too long to be stated in the abstract. Our proof establishes actually a refinement of that part...

متن کامل

A Combinatorial proof of a partition identity of Andrews and Stanley

In his paper, “On a Partition Function of Richard Stanley,” George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.

متن کامل

1 A ug 2 00 3 A Four - parameter Partition Identity

where Par denotes the set of all partitions, |λ| denotes the size (sum of the parts) of λ, θ(λ) denotes the number of odd parts in the partition λ, and θ(λ) denotes the number of odd parts in the conjugate of λ. A combinatorial proof of Andrews’ result was found by Sills in [2]. In this paper, we generalize this result and provide a combinatorial proof of our generalization. This gives a simple...

متن کامل

An Involution Proof of the Alladi-Gordon Key Identity for Schur's Partition Theorem

The Alladi-Gordon identity ∑j k=0(q i−k+1; q)k [ j k ] q(i−k)(j−k) = 1 plays an important role for the Alladi-Gordon generalization of Schur’s partition theorem. By using Joichi-Stanton’s insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key identity. Based on this interpretation, we further obtain a combinatorial proof of the Alladi-Gordon key identity by es...

متن کامل

A Combinatorial Proof of an Identity of Andrews

We give a combinatorial proof of an identity originally proved by G. E. Andrews in [1]. The identity simplifies a mock theta function first discovered by Rogers. 1 Background and Definitions First we review the basics of partition theory. Definition 1.1. A partition λ of a positive integer n is a finite nonincreasing sequence of positive integers λ1, λ2, . . . , λr such that ∑ r i=1 λi = n. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2014